全文获取类型
收费全文 | 72590篇 |
免费 | 10096篇 |
国内免费 | 5921篇 |
学科分类
工业技术 | 88607篇 |
出版年
2024年 | 238篇 |
2023年 | 1458篇 |
2022年 | 2644篇 |
2021年 | 2849篇 |
2020年 | 3136篇 |
2019年 | 2740篇 |
2018年 | 2471篇 |
2017年 | 3040篇 |
2016年 | 3414篇 |
2015年 | 3760篇 |
2014年 | 5624篇 |
2013年 | 5460篇 |
2012年 | 6195篇 |
2011年 | 6109篇 |
2010年 | 4351篇 |
2009年 | 4725篇 |
2008年 | 4277篇 |
2007年 | 4681篇 |
2006年 | 3918篇 |
2005年 | 3249篇 |
2004年 | 2587篇 |
2003年 | 2107篇 |
2002年 | 1748篇 |
2001年 | 1489篇 |
2000年 | 1186篇 |
1999年 | 840篇 |
1998年 | 743篇 |
1997年 | 600篇 |
1996年 | 491篇 |
1995年 | 459篇 |
1994年 | 384篇 |
1993年 | 297篇 |
1992年 | 249篇 |
1991年 | 206篇 |
1990年 | 190篇 |
1989年 | 175篇 |
1988年 | 117篇 |
1987年 | 53篇 |
1986年 | 43篇 |
1985年 | 30篇 |
1984年 | 28篇 |
1983年 | 29篇 |
1982年 | 28篇 |
1981年 | 20篇 |
1980年 | 22篇 |
1979年 | 21篇 |
1975年 | 11篇 |
1963年 | 9篇 |
1959年 | 11篇 |
1951年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
21.
针对当前基于深度学习的显著性检测算法缺少利用先验特征和边缘信息,且在复杂场景中难以检测出鲁棒性强的显著性区域的问题,提出了一种结合边缘特征,利用先验信息引导的全卷积神经网络显著性检测算法。该算法利用三种被经常用到的先验知识结合边缘信息形成先验图,通过注意力机制将提取的先验特征与深度特征有效融合,最终通过提出的循环卷积反馈优化策略迭代地学习改进显著性区域,从而产生更可靠的最终显著图预测。经过实验定性定量分析,对比证明了算法的可靠性。 相似文献
22.
针对货运车辆在配送调度过程中产生大量碳排放的问题,建立模型将多种影响碳排放量的因素协同优化。模型中考虑了不同载重量的异质车队,两个节点之间有多条道路的柔性路径,以及车辆重量随卸货而减少的动态负载等因素,以碳排放量、行驶时间和行驶路程为优化目标,并加入了节点需求时间窗、根据速度变化划分路段、交接和卸货时间的约束。提出了一种混合蚁群算法,利用蚁群算法信息素强度更新方式保持群体记忆性,利用粒子群算法的快速收敛特性增加计算效率。通过随机数值算例的仿真优化与对比分析,验证了算法和模型的有效性。 相似文献
23.
5G standard uses millimeter wave band to realize communication. In order to cover more reasonable in 5G communication
system, beamforming technology must be adopted. To speed up the convergence, a novel algorithm based on the SWO criterion is
proposed which can be applied in millimeter wave communication. The simulation results show that compared with other beamform-
ing algorithms, the proposed algorithm can achieve higher convergence speed and is more realizable. 相似文献
24.
This paper presents a control design for the one‐phase Stefan problem under actuator delay via a backstepping method. The Stefan problem represents a liquid‐solid phase change phenomenon which describes the time evolution of a material's temperature profile and the interface position. The actuator delay is modeled by a first‐order hyperbolic partial differential equation (PDE), resulting in a cascaded transport‐diffusion PDE system defined on a time‐varying spatial domain described by an ordinary differential equation (ODE). Two nonlinear backstepping transformations are utilized for the control design. The setpoint restriction is given to guarantee a physical constraint on the proposed controller for the melting process. This constraint ensures the exponential convergence of the moving interface to a setpoint and the exponential stability of the temperature equilibrium profile and the delayed controller in the norm. Furthermore, robustness analysis with respect to the delay mismatch between the plant and the controller is studied, which provides analogous results to the exact compensation by restricting the control gain. 相似文献
25.
ABSTRACTThis paper studies stochastic optimization problems with polynomials. We propose an optimization model with sample averages and perturbations. The Lasserre-type Moment-SOS relaxations are used to solve the sample average optimization. Properties of the optimization and its relaxations are studied. Numerical experiments are presented. 相似文献
26.
27.
28.
29.
Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like -means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in -means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to -means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than -means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives. 相似文献
30.
The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research. 相似文献